#include <bits/stdc++.h>

#define in read()
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
#define vec vector<int>
#define y1 y_____hahahaha_____1

using namespace std;

typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;

int read(){int x = 0,sgn = 1;char ch = getchar();for(;!isdigit(ch);ch = getchar()) if(ch == '-') sgn = -1;for(;isdigit(ch);ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48); return x * sgn;}

const int N = 210;
const int mod = 998244353;

int pw[N],n,x[N],y[N];
int ans;

int upd(int x){return x + (x >> 31 & mod);}

ll sq(ll x){return x * x;}

bool same_line(ll x1,ll y1,ll x2,ll y2){return x1 * x2 + y1 * y2 >= 0 && sq(x1 * x2 + y1 * y2) == (sq(x1) + sq(y1)) * (sq(x2) + sq(y2));}
//cos = 0

int main(){
#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
#endif
	n = in;
	for(int i = 1;i <= n;i++) x[i] = in,y[i] = in;
	for(int i = (pw[0] = 1);i <= n;i++) pw[i] = pw[i - 1] * 2ll % mod;
	ans = upd(pw[n] - n - 1);
	for(int i = 1;i <= n;i++)
		for(int j = 1;j < i;j++){
			int cc = 0;
			for(int k = 1;k <= n;k++)
				if(i ^ k && k ^ j && same_line(x[i] - x[k],y[i] - y[k],x[k] - x[j],y[k] - y[j])) cc++;
			ans = upd(ans - pw[cc]);
		}
	printf("%d\n",ans);
	return 0;
}
